Research Cell: An International Journal of Engineering Sciences

Satish Mittal ¹, G. N. Singh ²

Affiliations
1 University Computer Centre, Punjabi University, Patiala, Punjab, IN
2 Department of Computer Science, SD College, Lalgaon, Rewa (MP), IN

Abstract

In this paper performance comparisons of mobile ad hoc network's protocol with its quality of service factors has been measured. It is seen that mobile ad hoc networks will be an integral part of next generation networks because of its flexibility, infrastructure less nature, ease of maintenance, auto configuration, self administration capabilities, and costs effectiveness. This research paper shows comparison within mobile ad hoc networks' routing protocols from reactive, proactive and hybrid categories. We comprehensively analyzed the results of simulation for mobile ad hoc routing protocols over the performance metrics of packet delivery ratio, end to end delay, media access delay and throughput for optimized link state routing, temporary ordered routing algorithm and ad hoc on demand distance vector protocol. In mobile ad hoc networks, mobile nodes must collaborate with each other in order to interconnect, organize the dynamic topology as mobility cause route change and establish communication over wireless links. Our simulation results show the lead of proactive over reactive and hybrid protocols in routing traffic for dynamic changing topology. Proactive protocol optimized link state routing, a protocol for building link tables for ad-hoc networks, can transmit traffic more rapidly though involve less processing speed in packet forwarding.

Keywords

MANET, Mobility, Routing Protocol, Wireless.

Full Text

   

Gagandeep Singh Brar ¹, G. N. Singh ², Anupam Bhatia ³

Affiliations
1 Department of Computer Science, D.A.V. Colege, Sector 10, Chandigarh, Punjab, IN
2 Department of Computer Science, SD College, Lalgaon, Rewa (MP),, IN
3 Department of Computer Science, Kurukshetra University, Regional Centre, Jind (Haryana), IN

Abstract

TCP's bidirectional traffic causes self-interference in contention-based wireless links as in IEEE 802.11 wireless LANs and results in the loss of TCP data segments and ACKs. The fast-recovery algorithm is the basis for congestion control in most TCP enhancements proposed to address wireless network characteristics. However we show in this paper, that fast-recovery worsens performance during self-interference by causing deadlock situations that only terminate with a timeout. Both Reno and New Reno are evaluated in comparison to the lesser-optimized TCP-Tahoe to demonstrate the degradation in performance during fast-recovery. The less-optimized TCP-Tahoe that forgets all outstanding packets soon after fast-retransmit, outperforms TCP-Reno with an 80% gain in throughput. For the minrto_ parameter set to 1 second, Tahoe outperforms New Reno by a significant margin. A key contribution in this paper is the visualization of TCP dynamics that capture MAC layer collisions due to self-interference, and the protocols' behavior during congestion control. The paper demonstrates the disadvantages of combined error and flow control and makes a sound case for cross-layer awareness in transport protocols over wireless networks.

Full Text